On identities of Watson type
نویسندگان
چکیده
منابع مشابه
A note on Hoffman-type identities of graphs
An eigenvalue of a graph G is called main eigenvalue if it has an eigenvector the sum of whose entries is not equal to zero. Hoffman [A.J. Hoffman, On the polynomial of a graph, Amer. Math. Monthly 70 (1963) 30–36] proved that G is a connected k-regular graph if and only if n ∏t i=2(A− λiI ) = ∏t i=2(k − λi) · J , where I is the unit matrix and J the all-one matrix and λ1 = k, λ2, . . . , λt ar...
متن کاملOperations on posets and rational identities of type A
(xi − xj) . The patterns appear in geometry, characterizing some families of Schubert varieties. Schubert varieties are indexed by permutations, and the varieties which are non singular are those whose indexing permutation does not contain the pattern 2143 nor the pattern 1324. In [2], Cortez has described geometrical properties of Schubert varieties for permutations avoiding the patterns 1324 ...
متن کاملFinite Rogers-Ramanujan Type Identities
Polynomial generalizations of all 130 of the identities in Slater’s list of identities of the Rogers-Ramanujan type are presented. Furthermore, duality relationships among many of the identities are derived. Some of the these polynomial identities were previously known but many are new. The author has implemented much of the finitization process in a Maple package which is available for free do...
متن کاملThe Abel-Type Polynomial Identities
The Abel identity is (x + y) = n ∑ i=0 ( n i ) x(x − iz)i−1(y + iz)n−i, where x, y and z are real numbers. In this paper we deduce several polynomials expansions, referred to as Abel-type identities, by using Foata’s method, and also show some of their applications.
متن کاملGoing Watson on MNIST
Description of task: The MNIST, a database of Handwritten Digit Classification, (possibly) the most famous dataset in the field of Machine Learning is studied using different classification techniques on it and did a comparative analysis to reproduce the best possible accuracy on it. The standard algorithms were improved by applying various techniques such as extracting features via feature ext...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ars Mathematica Contemporanea
سال: 2019
ISSN: 1855-3974,1855-3966
DOI: 10.26493/1855-3974.1782.127